Contributory Broadcast Encryption on Sharingdata Over Dynamic Group Key Agreement
نویسندگان
چکیده
منابع مشابه
Bridging Broadcast Encryption and Group Key Agreement
Broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but requires a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the members can decrypt the ciphertexts encrypted under the shared encryption key, but a sender cannot exclude ...
متن کاملElliptic Curve Based Dynamic Contributory Group Key Agreement Protocol for Secure Group Communication over Ad-hoc Networks
The aim of this paper is to propose an efficient and simpler Contributory Group Key Agreement protocol (CGKA) based on Elliptic Curve Diffie Hellman (ECDH). In this CGKA protocol, a member acts as a group controller (GC) and forms two-party groups with remaining group members and generates an ECDH-style shared key per each two-party group. It then combines these keys into a single group key and...
متن کاملAsymmetric group key agreement protocol for open networks and its application to broadcast encryption
Asymmetric group key agreement is a recently introduced versatile cryptographic primitive. It allows a group of users to negotiate a common encryption key which is accessible to any entities, and each user only holds her respective secret decryption key. This concept not only enables confidential communications among group users but also permits any outsider to send encrypted messages to the gr...
متن کاملRound-Optimal Contributory Conference Key Agreement
Becker and Wille derived a lower bound of only one round for multi-party contributory key agreement protocols. Up until now no protocol meeting this bound has been proven secure. We present a protocol meeting the bound and prove it is secure in Bellare and Rogaway’s model. The protocol is much more efficient than other conference key agreement protocols with provable security, but lacks forward...
متن کاملKey agreement over a 3-receiver broadcast channel
In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state information is non-causally available at the transmitter. We consider two setups. In the first setup, the transmitter tries to agree on a common key with the legitimat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Scientific Research in Computer Science, Engineering and Information Technology
سال: 2019
ISSN: 2456-3307
DOI: 10.32628/cseit1952294